Dual and inverse formulations of constrained extremum problems
نویسندگان
چکیده
منابع مشابه
Dual and Inverse Formulations of Constrained Extremum Problems
In this paper we consider constrained extremum problems of the formB,, : inf ,f(~),UEf-‘(P) where .f‘ and r are continuously differentiable functionals on a reflexive Banach space2’ and where r-‘(p) denotes the level set of the functional I with value p E R.Related to problems 8,, we investigate inverse extremum problems, which are ex-tremum problems for the functional r on ...
متن کاملNonlinear Separation Approach to Constrained Extremum Problems
In this paper, by virtue of a nonlinear scalarization function, two nonlinear weak separation functions, a nonlinear regular weak separation function, and a nonlinear strong separation function are first introduced, respectively. Then, by the image space analysis, a global saddle-point condition for a nonlinear function is investigated. It is shown that the existence of a saddle point is equiva...
متن کاملDual representations for positively homogeneous functions: an application to constrained extremum problems
The aim of the present paper is to provide a unitary exposition on possible representations for positively homogeneous functions in the dual space. Starting from the classical Minkowski–Hörmander duality result of convex analysis, we develop a scheme in order to associate to a positively homogeneous function families of sublinear functionals representing it. Such dual description allows us to c...
متن کاملInverse Spanning Tree Problems: Formulations and Algorithms
Given a solution x* and an a priori estimated cost vector c, the inverse optimization problem is to identify another cost vector d so that x* is optimal with respect to the cost vector d and the deviation of d from c is minimum. In this paper, we consider the inverse spanning tree problem on an undirected graph G = (N, A) with n nodes and m arcs, and where the deviation between c and d is defin...
متن کاملEpigraphical splitting for solving constrained convex formulations of inverse problems with proximal tools
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different, but possibly overlapping, blocks of the signal. For such constraints, the associated projection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling
سال: 1980
ISSN: 0270-0255
DOI: 10.1016/0270-0255(80)90060-3